Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
231	Complexity of 10 Decision Problems in Continuous Time Dynamical Systems Amir Ali Ahmadi IBM Watson Research Center Anirudha Majumdar MIT Add to Reading List Source URL: web.mit.edu Language: English - Date: 2013-06-23 10:21:36 Dynamical systems Stability theory Lyapunov function Lyapunov stability Quadratic Polynomial P versus NP problem Time complexity Lyapunov theory Theoretical computer science Mathematics Computational complexity theory
232	Paradox Issue 2, 2003 The Magazine of the Melbourne University Mathematics and Statistics Society Joe Healy Add to Reading List Source URL: www.ms.unimelb.edu.au Language: English - Date: 2011-11-19 03:23:12 Complexity classes Mathematical optimization W. B. R. Lickorish P versus NP problem Travelling salesman problem Time complexity NP Knot theory P Theoretical computer science Computational complexity theory Applied mathematics
233	CCCG 2011, Toronto ON, August 10–12, 2011 Robust approximate assembly partitioning Elisha Sacks∗ Victor Milenkovic† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:12 Analysis of algorithms Computational complexity theory Convex geometry Digital geometry Minkowski addition Algorithm Time complexity Mathematics Theoretical computer science Geometry
234	On Two Class-Constrained Versions of the Multiple Knapsack Problem ∗ Hadas Shachnai † Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-04-15 10:32:13 Operations research Combinatorial optimization NP-complete problems Mathematical optimization Dynamic programming Knapsack problem Job shop scheduling Optimization problem Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
235	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Time, space, and precision: Revisiting classic problems in computational geometry with degree-driven analysis Jack Snoeyink∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-08-04 14:37:40 Analysis of algorithms Computational complexity theory Computer arithmetic Algorithm Mathematical logic Floating point Computational geometry Time complexity Model of computation Theoretical computer science Applied mathematics Computer science
236	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Cole’s Parametric Search Technique Made Practical Michael T. Goodrich Pawel Pszona Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Order theory Quicksort Algorithm Merge sort Time complexity Selection algorithm Sorting network Randomized algorithm Self-balancing binary search tree Mathematics Sorting algorithms Theoretical computer science
237	On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs Florham Park, NJ Ryan Williams† Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2009-11-12 23:47:30 NP-complete problems Logic in computer science Exponential time hypothesis 2-satisfiability Boolean satisfiability problem Conjunctive normal form Time complexity Parameterized complexity Dominating set Theoretical computer science Computational complexity theory Applied mathematics
238	LNCSThe Lost Continent of Polynomial Time: Preprocessing and Kernelization Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:25:39 Analysis of algorithms Complexity classes Parameterized complexity Kernelization NP-complete problems Time complexity PP Polynomial NP Theoretical computer science Computational complexity theory Applied mathematics
239	informs MATHEMATICS OF OPERATIONS RESEARCH Vol. 00, No. 0, Xxxxxx 20xx, pp. xxx–xxx ISSN 0364-765X \| EISSN \|xx\|0000\|0xxx Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-09-10 09:13:15 Operations research Submodular set function Computational complexity theory Linear programming Randomized rounding Continuous function Optimization problem Mathematical optimization Time complexity Theoretical computer science Mathematics Applied mathematics
240	CS 373: Combinatorial Algorithms, Spring 1999 Midterm 1 (February 23, 1999) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:54:11 Binary trees Analysis of algorithms Splay tree Randomized algorithm Fibonacci number Treap Time complexity Algorithm Factorial Mathematics Theoretical computer science Applied mathematics

UPDATE